Upper and lower optimal stopping bounds

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper and lower bounds of symmetric division deg index

Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...

متن کامل

Upper and lower bounds for numerical radii of block shifts

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

متن کامل

Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules

The integration of virtual memory management and interprocess communication in accent, " ACM Trans. Memory coherence in shared virtual memory systems, " ACM Trans. An efficient checkpointing method for multicomputers with wormhole routing. " Inr. [27] M. E. Staknis, " Sheaved memory: Architectural support for state saving and restoration in paged systems, " in 3rd Int. Abstract-The lower and up...

متن کامل

Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation

This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the underlying idea of a number of recent approaches which are varyingly called node splitting, variable renaming, variable splitting, or dissociation for probabil...

متن کامل

Lower Bounds and Upper Bounds for MaxSAT

This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is init...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Herald of CEMI

سال: 2018

ISSN: 2658-3887

DOI: 10.33276/s0000129-4-1